Distance Geometry in Linearizable Norms
نویسندگان
چکیده
Distance Geometry puts the concept of distance at its center. The basic problem in distance geometry could be described as drawing an edge-weighted undirected graph in R for some given K such that the positions for adjacent vertices have distance which is equal to the corresponding edge weight. As we are unaware of any work in this field using any other norm but `2, we move some first steps using the `1 and `∞ norms: we discuss worst-case complexity, propose mixed-integer linear programming formulations, and sketch a few heuristic ideas.
منابع مشابه
Fast Time Sequence Indexing for Arbitrary Lp Norms
Fast indexing in time sequence databases for similarity searching has attracted a lot of research recently. Most of the proposals, however, typically centered around the Euclidean distance and its derivatives. We examine the problem of multimodal similarity search in which users can choose the best one from multiple similarity models for their needs. In this paper, we present a novel and fast i...
متن کاملAlternative approaches to obtain t-norms and t-conorms on bounded lattices
Triangular norms in the study of probabilistic metric spaces as a special kind of associative functions defined on the unit interval. These functions have found applications in many areas since then. In this study, we present new methods for constructing triangular norms and triangular conorms on an arbitrary bounded lattice under some constraints. Also, we give some illustrative examples for t...
متن کاملInverse Maximum Dynamic Flow Problem under the Sum-Type Weighted Hamming Distance
Inverse maximum flow (IMDF), is among the most important problems in the field ofdynamic network flow, which has been considered the Euclidean norms measure in previousresearches. However, recent studies have mainly focused on the inverse problems under theHamming distance measure due to their practical and important applications. In this paper,we studies a general approach for handling the inv...
متن کاملNCGPC with dynamic extension applied to a Turbocharged Diesel Engine
This paper presents a control design method applied to diesel engines equipped with a Variable Geometry Turbocharger (VGT) and an Exhaust Gas Recirculation (EGR) valve. The objective of this control is to reduce gas pollution to the fixed rate norms imposed by Euro v and Euro vi, Arnold et al. [2006] (Transport and E. E. Federation [2004] and Umweltbundesamt [2003]) without loosing the torque p...
متن کاملChordal Axis on Weighted Distance Transforms
Chordal Axis (CA) is a new representation of planar shapes introduced by Prasad in [7], useful for skeleton computation, shape analysis, characterization and recognition. The CA is a subset of chord and center of disks tangent to the contour of a shape, derivated from Medial Axis (MA). Originally presented in a computational geometry approach, the CA was extracted on a constrained Delaunay tria...
متن کامل